Self-stabilizing Weight-Based Clustering Algorithm for Ad Hoc Sensor Networks

نویسندگان

  • Colette Johnen
  • Le Huy Nguyen
چکیده

Ad hoc sensor networks consist of large number of wireless sensors that communicate with each other in the absence of a xed infrastructure. Fast self-recon guration and power e ciency are very important property on any sensor network management. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. Clustering increase the scalability and the energy e ciency of communication among the sensors. A self-stabilizing algorithm, regardless of the initial system state, converges to a set of states that satisfy the problem speci cation without external intervention. Due to this property, self-stabilizing algorithms are adapted highly dynamic networks. In this paper we present a Self-stabilizing Clustering Algorithm for Ad hoc sensor network. Our algorithm adapts faster than other algorithms to topology changes.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Robust self-stabilizing weight-based clustering algorithm

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such networks cannot rely on centralized and organized network management. The clustering problem consists of partitioning network nodes into non-overlapping groups called clusters. Clusters give a hierarchical organization to the network that facilitates the network management a...

متن کامل

Self-Stabilizing Clustering Algorithm for Ad hoc Networks

Ad hoc networks consist of wireless hosts that communicate with each other in the absence of a fixed infrastructure. Such network cannot rely on centralized and organized connectivity. The clustering problem consists in partitioning network nodes into groups called clusters, thus giving at the network a hierarchical organization. Clustering is commonly used in order to limit the amount of routi...

متن کامل

Determining Cluster-Heads in Mobile Ad-Hoc Networks Using Multi-Objective Evolutionary based Algorithm

A mobile ad-hoc network (MANET), a set of wirelessly connected sensor nodes, is a dynamic system that executes hop-by-hop routing independently with no external help of any infrastructure. Proper selection of cluster heads can increase the life time of the Ad-hoc network by decreasing the energy consumption. Although different methods have been successfully proposed by researchers to tackle...

متن کامل

Determining Cluster-Heads in Mobile Ad-Hoc Networks Using Multi-Objective Evolutionary based Algorithm

A mobile ad-hoc network (MANET), a set of wirelessly connected sensor nodes, is a dynamic system that executes hop-by-hop routing independently with no external help of any infrastructure. Proper selection of cluster heads can increase the life time of the Ad-hoc network by decreasing the energy consumption. Although different methods have been successfully proposed by researchers to tackle...

متن کامل

Self-Stabilizing Bounded Size Clustering Algorithm

Clustering means partitioning nodes into groups called clusters, providing the network with a hierarchical organization. Overall, clustering increases the scalability of network management. For instance, clustering-based routing reduces the amount of routing information propagated in the network; members of a cluster can share resources; and clustering can be used to reduce the amount of inform...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2006